Deriving Stopping Rules for the Probabilistic Hough Transform by Sequential Analysis
نویسندگان
چکیده
It is known that Hough Transform computation can be signiicantly accelerated by polling instead of voting. A small part of the data set is selected at random and used as input to the algorithm. The performance of these Proba-bilistic Hough Transforms depends on the poll size. Most Probabilistic Hough algorithms use a xed poll size, which is far from optimal since conservative design requires the xed poll size to be much larger than necessary in average conditions. It has recently been experimentally demonstrated that adaptive termination of voting can lead to improved performance in terms of the error rate versus average poll size tradeoo. However, the lack of a solid theoretical foundation made general performance evaluation and optimal design of adap-tive stopping rules nearly impossible. In this paper it is shown that the statistical theory of sequential hypotheses testing can provide a useful theoretical framework for the analysis and development of adaptive stopping rules for the Probabilistic Hough Transform. The algorithm is restated in statistical terms and two novel rules for adaptive termination of the polling are developed. The performance of the suggested stopping rules is veriied using synthetic data as well as real images. It is shown that the extension suggested in this paper to Wald's one sided alternative sequential test performs better than previously available adaptive (or xed) stopping rules.
منابع مشابه
Iris localization by means of adaptive thresholding and Circular Hough Transform
In this paper, a new iris localization method for mobile devices is presented. Our system uses both intensity and saturation threshold on the captured eye images to determine iris boundary and sclera area, respectively. Estimated iris boundary pixels which have been placed outside the sclera will be removed. The remaining pixels are mainly the boundary of iris inside the sclera. Then, circular ...
متن کاملDetection of Microaneurysms in Retinal Angiography Images Using the Circular Hough Transform
This paper presents an automated method for detecting microaneurysms in the retinal angiographic images by using image processing techniques. In the presented method, in order to fade or remove the pseudo images, first retinal images are pre-processed. Then microaneurysms are identified by circular Hough transform. In the existing methods of dete...
متن کاملDetection of Microaneurysms in Retinal Angiography Images Using the Circular Hough Transform
This paper presents an automated method for detecting microaneurysms in the retinal angiographic images by using image processing techniques. In the presented method, in order to fade or remove the pseudo images, first retinal images are pre-processed. Then microaneurysms are identified by circular Hough transform. In the existing methods of dete...
متن کاملConnective Randomized Hough Transform (crht)
A new branch of Hough Transform algorithms, called probabilistic Hough Transforms, has been actively developed in recent years. One of the rst was a new and eecient probabilistic version of the Hough Transform for curve detection, the Randomized Hough Transform (RHT). The RHT picks n pixels from an edge image by random sampling to solve n parameters of a curve and then accumulates only one cell...
متن کاملRandomized or probabilistic Hough transform: unified performance evaluation
Rapid computation of the Hough Transform is necessary in very many computer vision applications. One of the major approaches for fast Hough Transform computation is based on the use of a small random sample of the data set rather than the full set. Two diierent algorithms within this family are the Randomized Hough Transform (RHT) and the Probabilistic Hough Transform (PHT). There have been con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Vision and Image Understanding
دوره 63 شماره
صفحات -
تاریخ انتشار 1996